Process Algebra and Information Flow
نویسنده
چکیده
Controlling information flows through a system is the fundamental issue in information security. It turns out that making precise the notion of information flow, and in particular the absence of information flow, is a remarkably subtle question. Many formalizations have been proposed, many inspired by the seminal ideas of Goguen and Meseguer with their notion of non-interference. Even now the security community has not reached a consensus on its definition. In this talk we show that casting the problem in a process algebraic framework sheds light on many of the sources of controversy. In particular we argue that non-interference reduces to characterizing the equivalence of processes, itself a rather controversial problem in the process algebra world. 1571-0661/$ – see front matter c © Elsevier Ltd 10.1016/S1571-0661(05)80063-5
منابع مشابه
Stochastic averaging for SDEs with Hopf Drift and polynomial diffusion coefficients
It is known that a stochastic differential equation (SDE) induces two probabilistic objects, namely a difusion process and a stochastic flow. While the diffusion process is determined by the innitesimal mean and variance given by the coefficients of the SDE, this is not the case for the stochastic flow induced by the SDE. In order to characterize the stochastic flow uniquely the innitesimal cov...
متن کاملInformation Flow Analysis via Equational Reasoning
In this work, a process algebra is designed around an ACUID equational theory extended with prefixes symbolizing actions, and by making parallel synchronous composition distributive over non-deterministic choice; such a synchronous composition is commutative and non-associative. Bisimulation between processes is then interpretable as congruence over such an equational theory. It is shown that i...
متن کاملProcess algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملAction Refinement in Process Algebra and Security Issues
In the design process of distributed systems we may have to replace abstract specifications of components by more concrete specifications, thus providing more detailed design information. In the context of process algebra, this well-known approach is often referred to as action refinement. We study the relationships between action refinement and security properties within the Security Process A...
متن کاملProbabilistic Information Flow Security
A formal model for description of probabilistic timing attacks is presented and studied. It is based on a probabilistic timed process algebra, on observations (mappings which make visible only a part of system behavior) and on an information flow. The resulting security properties are studied and compared with other security concepts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 40 شماره
صفحات -
تاریخ انتشار 2000